Termination Proof Script

Consider the TRS R consisting of the rewrite rules
1:    le(0,y)  → true
2:    le(s(x),0)  → false
3:    le(s(x),s(y))  → le(x,y)
4:    pred(s(x))  → x
5:    minus(x,0)  → x
6:    minus(x,s(y))  → pred(minus(x,y))
7:    gcd(0,y)  → y
8:    gcd(s(x),0)  → s(x)
9:    gcd(s(x),s(y))  → if_gcd(le(y,x),s(x),s(y))
10:    if_gcd(true,s(x),s(y))  → gcd(minus(x,y),s(y))
11:    if_gcd(false,s(x),s(y))  → gcd(minus(y,x),s(x))
There are 9 dependency pairs:
12:    LE(s(x),s(y))  → LE(x,y)
13:    MINUS(x,s(y))  → PRED(minus(x,y))
14:    MINUS(x,s(y))  → MINUS(x,y)
15:    GCD(s(x),s(y))  → IF_GCD(le(y,x),s(x),s(y))
16:    GCD(s(x),s(y))  → LE(y,x)
17:    IF_GCD(true,s(x),s(y))  → GCD(minus(x,y),s(y))
18:    IF_GCD(true,s(x),s(y))  → MINUS(x,y)
19:    IF_GCD(false,s(x),s(y))  → GCD(minus(y,x),s(x))
20:    IF_GCD(false,s(x),s(y))  → MINUS(y,x)
The approximated dependency graph contains 3 SCCs: {12}, {14} and {15,17,19}.
Tyrolean Termination Tool  (0.26 seconds)   ---  May 3, 2006